Vertices with the second neighborhood property in Eulerian digraphs
نویسندگان
چکیده
منابع مشابه
Second Neighborhood via First Neighborhood in Digraphs
Let D be a simple digraph without loops or digons. For any v ∈ V (D), the first out-neighborhood N(v) is the set of all vertices with out-distance 1 from v and the second neighborhood N(v) of v is the set of all vertices with out-distance 2 from v. We show that every simple digraph without loops or digons contains a vertex v such that |N++(v)| ≥ γ|N+(v)|, where γ = 0.657298 . . . is the unique ...
متن کاملEulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three
A colored eulerian digraph is an eulerian digraph G where a color is assigned to the tail of each edge and a color is assigned to the head of each edge. A compatible circuit is an eulerian circuit such that for every two consecutive edges uv and vw of the circuit, the color of the head of uv is different from the color of the tail of vw. Let S3 be the set of vertices of outdegree and indegree t...
متن کاملOn Seymour's Second Neighborhood conjecture of m-free digraphs
This paper gives an approximate result related to Seymour’s Second Neighborhood conjecture, that is, for anym-free digraph G, there exists a vertex v ∈ V (G) and a real number λm such that d(v) ≥ λmd+(v), and λm → 1 while m → +∞. This result generalizes and improves some known results in a sense. © 2017 Elsevier B.V. All rights reserved.
متن کاملEulerian Subgraphs Containing Given Vertices
A vertex set S ⊆ V (G) is k-weak-edge-connected if for every C ⊂ S and x ∈ S−C there are min{k, |C|} edge-disjoint (x,C)-paths in G. For a graph G and a k-weakedge-connected vertex set S ⊂ V (G) with k ≥ 3 and 4 ≤ |S| ≤ 2k, we show that G has an eulerian subgraph containing all vertices in S.
متن کاملEulerian subgraph containing given vertices
A vertex set S ⊆ V (G) is k-weak-edge-connected if for every C ⊂ S and x ∈ S−C there are min{k, |C|} edge-disjoint (x,C)-paths in G. For a graph G and a k-weakedge-connected vertex set S ⊂ V (G) with k ≥ 3 and 4 ≤ |S| ≤ 2k, we show that G has an eulerian subgraph containing all vertices in S.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Opuscula Mathematica
سال: 2019
ISSN: 1232-9274
DOI: 10.7494/opmath.2019.39.6.765